Improved algorithms for a lot-sizing problem with inventory bounds and backlogging
نویسندگان
چکیده
منابع مشابه
A polynomial algorithm for a lot-sizing problem with backlogging, outsourcing and limited inventory
Article history: Received 11 December 2010 Received in revised form 28 June 2012 Accepted 20 August 2012 Available online 25 September 2012
متن کاملTwo-level lot-sizing with inventory bounds
We study a two-level uncapacitated lot-sizing problem with inventory bounds that occurs in a supply chain composed of a supplier and a retailer. The first level with the demands is the retailer level and the second one is the supplier level. The aim is to minimize the cost of the supply chain so as to satisfy the demands when the quantity of item that can be held in inventory at each period is ...
متن کاملAlgorithms for Stochastic Lot-Sizing Problems with Backlogging
As a traditional model in the operations research and management science domain, deterministic lot-sizing problem is embedded in many application problems such as production and inventory planning and has been consistently drawing attentions from researchers. In this paper we consider basic versions of lot-sizing models in which problem parameters are stochastic and develop corresponding scenar...
متن کاملOptimal Policy for Stochastic Lot-Sizing Inventory Model with Deterioration and Partial Backlogging
A finite horizon inventory model for a single deteriorating product is studied. The system is under periodic review and there is a positive fixed order cost associated with any placed order. The demand in successive periods is independent and identically distributed. A constant fraction of any positive leftover stock is deteriorated at the end of each period. Any unsatisfied demand is partially...
متن کاملA note on "The economic lot sizing problem with inventory bounds"
In a recent paper, Liu (2008) considers the lot-sizing problem with lower and upper bounds on the inventory levels. He proposes an O(n2) algorithm for the general problem, and an O(n) algorithm for the special case with non-speculative motives. We show that neither of the algorithms provides an optimal solution in general. Furthermore, we propose a fix for the former algorithm that maintains th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Naval Research Logistics (NRL)
سال: 2012
ISSN: 0894-069X
DOI: 10.1002/nav.21485